Logics Without the Contraction Rule
نویسندگان
چکیده
if we formulate our logics in a Gentzen-type formal system. Some syntactical properties of these logics have been studied firstly by the second author in [I I], in connection with the study of BCK-algebras (for information on BCK-algebras, see [9]). There, it turned out that such a syntactical method is a powerful and promising tool in studying BCK-algebras. Using this method, considerable progress has been made since then (see, e.g., [8], [18], [27]). In this paper, we will study these logics more comprehensively. We notice here that the distributive law
منابع مشابه
Logics without the contraction rule and residuated lattices
In this paper, we will develop an algebraic study of substructural propositional logics over FLew, i.e. the logic which is obtained from the intuitionistic logics by eliminating the contraction rule. Our main technical tool is to use residuated lattices as the algebraic semantics for them. This enables us to study different kinds of nonclassical logics, including intermediate logics, BCK-logics...
متن کاملContracting Logics
In this paper, inspired in the field of belief revision, it is presented a novel operation for defining a new logic given a known logic. The operation consists in removing some (maybe undesirable) derived rule from a logic. Besides removing the ‘undesirable’ rule, this operation (called contraction) should change the logic in a minimal way. This paper presents formal definitions for contraction...
متن کاملMultiple-valued Logic
s of the Talks In the order in which the talks were given. Walter Carnielli – Non-deterministic Semantics 5 Matthias Baaz – Analytic Calculi for Many-valued Logics 5 Hiroakira Ono – Many-valued Logics as Logics without the Contraction Rule 6 Reiner Hähnle – Proof Theory of Many-valued Logic and Hardware Design 7 Gonzalo Escalada-Imaz – Determining the Truth Degree in Real Time Settings 7 Peter ...
متن کاملCut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary rule. The first and second violate the subformula property and the third has infinitely many premises. We present finitary cut-free invariant-free weakeningfree and contraction-free sequent systems for both logics mentio...
متن کاملTranslating Labels to Hypersequents for Intermediate Logics with Geometric Kripke Semantics
We give a procedure for translating geometric Kripke frame axioms into structural hypersequent rules for the corresponding intermediate logics in Int/Geo that admit weakening, contraction and in some cases, cut. We give a procedure for translating labelled sequents in the corresponding logic to hypersequents that share the same linear models (which correspond to Gödel-Dummett logic). We prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 50 شماره
صفحات -
تاریخ انتشار 1985